vector<string> findWords(vector<string> &words)
{
    vector<string> vec;
    string m1 = "qwertyuiopQWERTYUIOP", m2 = "asdfghjklASDFGHJKL", m3 = "zxcvbnmZXCVBNM";
    // 遍历单词
    for (int i = 0; i < words.size(); i++)
    {
        int z = 0, x = 0, y = 0;
        int len = words[i].size();
        // 遍历字母
        for (int j = 0; j < len; j++)
        {
            // 寻找每个单词的字母在 m1 m2 m3中存在的次数
            if (m1.find(words[i][j]) != string::npos)
            {
                z++;
            }
            else if (m2.find(words[i][j]) != string::npos)
            {
                x++;
            }
            else if (m3.find(words[i][j]) != string::npos)
            {
                y++;
            }
        }
        // z x y 中 仅有一个不为0时 则推入数组
        if (z != 0)
        {
            if (x == 0 && y == 0)
            {
                vec.push_back(words[i]);
            }
        }
        else if (x != 0)
        {
            if (z == 0 && y == 0)
            {
                vec.push_back(words[i]);
            }
        }
        else if (y != 0)
        {
            if (z == 0 && x == 0)
            {
                vec.push_back(words[i]);
            }
        }
    }
    return vec;
}

